On the complexity of distributed graph coloring with local minimality constraints

نویسندگان

  • Cyril Gavoille
  • Ralf Klasing
  • Adrian Kosowski
  • Lukasz Kuszner
  • Alfredo Navarra
چکیده

Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. Given an order among the colors, a coloring is said to be greedy if there does not exist a vertex for which its associated color can be replaced by a color of lower position in the fixed order without violating the property that neighbouring vertices must receive different colors. We consider the problems of Greedy Coloring and Largest First Coloring (a variant of greedy coloring with strengthened constraints) in the Linial model of distributed computation, providing lower and upper bounds and a comparison to the (∆+1)-Coloring and Maximal Independent Set problems, with ∆ being the maximum vertex degree in G.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

الگوریتم ژنتیک با جهش آشوبی هوشمند و ترکیب چند‌نقطه‌ای مکاشفه‌ای برای حل مسئله رنگ‌آمیزی گراف

Graph coloring is a way of coloring the vertices of a graph such that no two adjacent vertices have the same color. Graph coloring problem (GCP) is about finding the smallest number of colors needed to color a given graph. The smallest number of colors needed to color a graph G, is called its chromatic number. GCP is a well-known NP-hard problems and, therefore, heuristic algorithms are usually...

متن کامل

A Note on Node Coloring in the SINR Model

A V-coloring of a graph G is a coloring of the nodes of G with V colors in such a way any two neighboring nodes have different colors. We prove that there exists a O(∆ log n) time distributed algorithm computing a O(∆)-coloring for unit disc graphs under the signal-tointerference-plus-noise ratio (SINR)-based physical model (∆ is the maximum degree of the graph). We also show that, for a well d...

متن کامل

On the Complexity of Distributed Greedy Coloring

Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. It still consists in coloring in a distributed setting each node of a given graph in such a way that two adjacent nodes do not get the same color, but it adds a further constraint. Given an order among the colors, a coloring is said to be greedy if there does not exist a node for which its as...

متن کامل

Data Hiding Method Based on Graph Coloring and Pixel Block‘s Correlation in Color Image

An optimized method for data hiding into a digital color image in spatial domainis provided. The graph coloring theory with different color numbers is applied. To enhance thesecurity of this method, block correlations method in an image is used. Experimental results showthat with the same PSNR, the capacity is improved by %8, and also security has increased in themethod compared with other meth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Networks

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2009